Positional procedures for solving dynamical optimization problems of prescribed duration ?

نویسندگان

  • Nina N. Subbotina
  • Alexander M. Tarasyev
  • Vladimir N. Ushakov
چکیده

Optimal control problems under conflict or uncertainties are considered on a finite time interval. Resolving dynamical procedures are suggested. They are based either on constructions of stable bridges produced with the help of step-by-step programmed absorptions or on applications of the backward dynamic programming method. Results of simulations illustrating the suggested methods are exposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

PROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

متن کامل

A Novel Heuristic Optimization Methodology for Solving of Economic Dispatch Problems

This paper presents a biogeography-based optimization (BBO) algorithm to solve the economic loadDispatch (ELD) problem with generator constraints in thermal plants. The applied method can solvethe ELD problem with constraints like transmission losses, ramp rate limits, and prohibited operatingzones. Biogeography is the science of the geographical distribution of biological species. The modelsof...

متن کامل

The Discrete Dynamical Functional Particle Method for Solving Constrained Optimization Problems

The dynamical functional particle method (DFPM) is a method for solving equations by using a damped second order dynamical system. The dynamical system is solved by a symplectic method that is especially tailored for conservative systems. In this work we have extended DFPM to convex optimization problems with constraints. The method is tested on linear eigenvalue problems with normalization and...

متن کامل

EFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008